#include <iostream>
#include "heads/tree.h"

int main()
{
    BiTree T1;
    cout << "请输入可以递归创建树的合法序列:";
    CreateBiTree(T1);
    cout << "\n先序遍历:";
    PreOrderTraverse(T1, PrintBiTNode);
    cout << "\n中序遍历:";
    InOrderTraverse(T1, PrintBiTNode);
    cout << "\n后序遍历:";
    PostOrderTraverse(T1, PrintBiTNode);
    cout << "\n非递归中序遍历:";
    InOrderTraverse2(T1, PrintBiTNode);
    cout << "EZ";
}